subset sum造句
例句與造句
- Subset sum can also be thought of as a special case of the knapsack problem.
- For example, an early suggestion was to use schemes based on the subset sum problem.
- There are several ways to solve subset sum in time exponential in " N ".
- The Merkle-Hellman system is based on the subset sum problem ( a special case of the knapsack problem ).
- Under certain assumptions, finding a collision in ECOH may be also viewed as an instance of the subset sum problem.
- It's difficult to find subset sum in a sentence. 用subset sum造句挺難的
- The 3-partition problem is similar to the partition problem, which in turn is related to the subset sum problem.
- The generalization of subset sum problem is called multiple subset-sum problem, in which multiple bins exist with the same capacity.
- In computer science, the "'subset sum problem "'is an important problem in complexity theory and cryptography.
- Consider the subset sum problem, an example of a problem that is easy to verify, but whose answer may be difficult to compute.
- For instance, the subset sum problem is this : " Given a set of numbers, does any subset of them sum to N ? ".
- In string theory the number of false vacua is thought to be somewhere between 10 10 to 10 500 . being a version of the subset sum problem.
- One interesting special case of subset sum is the partition problem, in which " s " is half of the sum of all elements in the set.
- The solution for subset sum also provides the solution for the original subset sum problem in the case where the numbers are small ( again, for nonnegative numbers ).
- The solution for subset sum also provides the solution for the original subset sum problem in the case where the numbers are small ( again, for nonnegative numbers ).
- The most na飗e algorithm would be to cycle through all subsets of N numbers and, for every one of them, check if the subset sums to the right number.
更多例句: 下一頁